Extensions of the ℵ0-Valued Lukasiewicz Propositional Logic

نویسنده

  • M. Gordon Beavers
چکیده

MV-algebras were introduced by Chang in 1958 preliminary to his providing an algebraic completeness proof for the K0-vaΓued Lukasiewicz propositional logic, LXo. In this paper a method is given for determining, for an arbitrary normal extension of LKo, an MV-algebra characteristic for the extension. The characteristic algebras are finite direct products of two sets of linearly ordered MV-algebras identified by Komori. Conversely, it is shown that, given an algebra which is isomorphic to the direct product of elements from these two sets of linearly ordered MV-algebras, a single axiom can be determined which, when added to the axioms for LXo, yields an axiomatization sound and weakly complete for the given algebra. As a consequence of the lattice ordering of these products of MV-algebras the cardinal and ordinal degrees of completeness of any normal extension of LKo can be determined. / Introduction In [4] Komori proves that any proper extension of LN o has a characteristic matrix isomorphic to a finite direct product of elements of two fundamental types of MV-algebras, thus providing a type of characterization for any axiomatic extension of LK o. We will provide a somewhat stronger result in Theorem 4.4 below as the principal result of this paper. Our result improves on Komori's by giving a method for determining which MV-algebras occur in the finite products. Using the notion of the genus of a formula, given in Rose [11], we show that a formula is satisfied in the Komori characterization if and only if it is of a corresponding genus. By connecting Komori's characterization with Rose's notion of genus it is possible to link characteristic matrices with extensions of LK o. This result amounts to a soundness and weak completeness theorem for the characterizations provided by Komori. 2 Lukasiewicz matrices The ^-valued Lukasiewicz propositional calculi (for n either an integer greater than 1 or Ko) were defined with the aid of logical Received October 26, 1992; revised March 10, 1993

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Admissible Rules of Lukasiewicz Logic

We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).

متن کامل

Interpolation and Three-valued Logics

We consider propositional logic. Three-valued logics are old: the first one is Lukasiewicz three valued logic from 1920 [8]. Gödel in [5] from 1932 studied a hierarchy of finite-valued logics, containing Gödel three-valued logic. Our main interest pays to Kleene three-valued logic [6]. Other threevalued logics will not be considered here. Let us agree that the three truth values are 0, 1 2 , 1 ...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Hintikka-Style Semantic Games for Fuzzy Logics

Various types of semantics games for deductive fuzzy logics, most prominently for Lukasiewicz logic, have been proposed in the literature. These games deviate from Hintikka’s original game for evaluating classical first-order formulas by either introducing an explicit reference to a truth value from the unit interval at each game state (as in [4]) or by generalizing to multisets of formulas to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 34  شماره 

صفحات  -

تاریخ انتشار 1993